Subset sum problem - PDFSEARCH.IO - Document Search Engine

Subset sum problem
Results: 25

#	Item
11	Noname manuscript No. (will be inserted by the editor) Generalizing Cryptosystems Based on the Subset Sum Problem Aniket Kate · Ian Goldberg Add to Reading List Source URL: www.cypherpunks.ca Language: English - Date: 2011-05-05 15:39:42 Security Paillier cryptosystem Merkle–Hellman knapsack cryptosystem Niederreiter cryptosystem Cryptography Post-quantum cryptography Cryptosystem RSA Semantic security Public-key cryptography Cyberwarfare Applied mathematics
12	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
13	Minimal Cost Reconfiguration of Data Placement in a Storage Area Network∗† Hadas Shachnai‡ Gal Tamir§ Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-01-28 14:03:26 Operations research Freedesktop.org X Window System Server Scalability Linear programming Subset sum problem Software System software Computing
14	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
15	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
16	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:43 Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
17	Sage Reference Manual: Numerical Optimization Release 6.6.beta0 The Sage Development Team Add to Reading List Source URL: sagemath.org Language: English - Date: 2015-02-21 07:35:22 Dynamic programming Operations research Cryptography Combinatorial optimization Knapsack problem Subset sum problem Sequence Exponentiation Linear programming Mathematics Theoretical computer science Computational complexity theory
18	F r o m Approximate to O p t i m a l Solutions: A Case Study of N u m b e r Partitioning Add to Reading List Source URL: ijcai.org Language: English - Date: 2008-09-30 05:19:33 NP-complete problems Mathematical optimization Operations research Dynamic programming Partition problem Search algorithms Subset sum problem Greedy algorithm Genetic algorithm Theoretical computer science Mathematics Applied mathematics
19	Performance Ratios for the Karmarkar-Karp Differencing Method Wil Michiels1 2 , Jan Korst2 , Emile Aarts1 2 , and Jan van Leeuwen3 1 Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands Add to Reading List Source URL: alexandria.tue.nl Language: English - Date: 2003-04-07 04:13:26 Subset sum problem Multiprocessor scheduling Applied mathematics NP-complete problems Theoretical computer science Dynamic programming Mathematical optimization

UPDATE